Dynamic Alignment and Distribution of Irregularly Coupled Data Arrays for Scalable Parallelization of Particle-in-Cell Problems
نویسندگان
چکیده
Particle-in-cell (PIC) plasma simulation codes require two data arrays—particle array and field array—for storing the lists of particles and electromagnetic fields, respectively. In every iteration the two are updated based on the values of each other. The interaction between these two arrays is dynamic due to the movement of particles. Efficient parallelization of PIC requires the two data arrays to be load balanced and the amount of communication generated due to the interaction between them to be minimized. This requires dynamic distribution and alignment of the two arrays. In this paper we present fast and efficient methods for achieving this task at runtime. The implementation and performance of a relativistic electromagnetic PIC plasma simulation code on the CM-5 are described.
منابع مشابه
Dynamic Work Distribution for PM Algorithm
Although poor for small dynamic scales, the Particle–Mesh (PM) model allows in astrophysics good insight for large dynamic scales at low computational cost. Furthermore, it is possible to employ a very high number of particles to get high mass resolution. These properties could be exploited by suitable parallelization of the algorithm. In PM there are two types of data: the particle data, i.e. ...
متن کاملAccess control in ultra-large-scale systems using a data-centric middleware
The primary characteristic of an Ultra-Large-Scale (ULS) system is ultra-large size on any related dimension. A ULS system is generally considered as a system-of-systems with heterogeneous nodes and autonomous domains. As the size of a system-of-systems grows, and interoperability demand between sub-systems is increased, achieving more scalable and dynamic access control system becomes an im...
متن کاملParallelization of Rich Models for Steganalysis of Digital Images using a CUDA-based Approach
There are several different methods to make an efficient strategy for steganalysis of digital images. A very powerful method in this area is rich model consisting of a large number of diverse sub-models in both spatial and transform domain that should be utilized. However, the extraction of a various types of features from an image is so time consuming in some steps, especially for training pha...
متن کاملAn approach to Improve Particle Swarm Optimization Algorithm Using CUDA
The time consumption in solving computationally heavy problems has always been a concern for computer programmers. Due to simplicity of its implementation, the PSO (Particle Swarm Optimization) is a suitable meta-heuristic algorithm for solving computationally heavy problems. However, despite the simplicity, the algorithm is inefficient for solving real computationally heavy problems but the pr...
متن کاملOptimal Reconfiguration of Solar Photovoltaic Arrays Using a Fast Parallelized Particle Swarm Optimization in Confront of Partial Shading
Partial shading reduces the power output of solar modules, generates several peak points in P-V and I-V curves and shortens the expected life cycle of inverters and solar panels. Electrical array reconfiguration of PV arrays that is based on changing the electrical connections with switching devices, can be used as a practical solution to prevent such problems. Valuable studies have been perfor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996